Towards Efficient and Robust BFT Protocols

نویسندگان

  • Lucas Perronne
  • Sara Bouchenak
چکیده

Byzantine Fault Tolerant (BFT) protocols rely on state machine replication to handle arbitrary behaviors. Significant efforts have been recently made to strengthen these protocols in order to minimize the performance degradation in presence of faulty components. In this paper, we focus on the potential damages that could be introduced from the client side of such protocols. In order to deal with this specific kind of threats, BFT protocols rely on request authentication to provide access control. Nevertheless, byzantine clients may benefit from the weakness of the underlying authentications mechanisms in order to tamper with the performance of replicated systems. We describe the main reliability issues that can be introduced by faulty clients in current BFT protocols, and we argue against the systematic usage of digital signatures. Finally, we propose a new policy in order to avoid the overhead due to systematic signatures verifications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contributions to Building Efficient and Robust State-Machine Replication Protocols

State machine replication (SMR) is a software technique for tolerating failures using commodity hardware. The critical service to be made fault-tolerant is modeled by a state machine. Several, possibly different, copies of the state machine are then deployed on different nodes. Clients of the service access the replicas through a SMR protocol which ensures that, despite concurrency and failures...

متن کامل

Stretching BFT

State-of-the-art BFT protocols remain far from the maximum theoretical throughput. Based on exhaustive evaluation and monitoring of existing BFT protocols, we highlight few impediments to their scaling. These include the use of IP multicast, the presence of bottlenecks due to asymmetric replica processing, and an unbalanced network bandwidth utilization. To better evaluate the actual impact of ...

متن کامل

Dynamic Distributed Computing with Byzantine Failures

Byzantine failure tolerance (BFT) is one of the most fundamental problem in distributed computing and has been researched extensively. However, due to the famous impossible result of FLP, there is no perfect way to solve it. Modern BFT protocols are usually proposed with practical assumptions such as partially synchrony, encrypted messages. Yet, designing dynamic BFT system with large number of...

متن کامل

Conflict-free Quorum-based BFT Protocols

Quorum-based Byzantine fault-tolerant protocols for replicated state machines allow replicas to respond to client requests without explicitly agreeing on the request ordering. As long as concurrent write operations do not conflict, quorum-based protocols are more efficient than agreement-based protocols. However, resolving conflicting writes and bringing replicas up-to-date with each other is a...

متن کامل

PhD Thesis: BYZANTINE FAULT TOLERANCE: FROM STATIC SELECTION TO DYNAMIC SWITCHING

Byzantine Fault Tolerance (BFT) is becoming crucial with the revolution of online applications and due to the increasing number of innovations in computer technologies. Although dozens of BFT protocols have been introduced in the previous decade, their adoption by practitioners sounds disappointing. To some extant, this indicates that existing protocols are, perhaps, not yet too convincing or s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017